Chaotic repellers in the antiferromagnetic Ising model

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Chaotic Repellers in Antiferromagnetic Ising Model

For the first time we present the consideration of the antiferromagnetic Ising model in case of fully developed chaos and obtain the exact connection between this model and chaotic repellers. We describe the chaotic properties of this statistical mechanical system via the invariants characterizing a fractal set and show that in chaotic region it displays phase transition at positive ”temperatur...

متن کامل

Antiferromagnetic Ising model in small-world networks.

The antiferromagnetic Ising model in small-world networks generated from two-dimensional regular lattices has been studied. The disorder introduced by long-range connections causes frustration, which gives rise to a spin-glass phase at low temperature. Monte Carlo simulations have been carried out to study the paramagnetic to spin-glass transition, as a function of the rewiring probability p , ...

متن کامل

Parry measure and the topological entropy of chaotic repellers embedded within chaotic attractors

We study the topological entropy of chaotic repellers formed by those points in a given chaotic attractor that never visit some small forbidden hole-region in the phase space. The hole is a set of points in the phase space that have a sequence α = (α0α1 . . . αl−1) as the first l letters in their itineraries. We point out that the difference between the topological entropies of the attractor an...

متن کامل

Structure learning of antiferromagnetic Ising models

In this paper we investigate the computational complexity of learning the graph structure underlying a discrete undirected graphical model from i.i.d. samples. Our first result is an unconditional computational lower bound of (pd/2) for learning general graphical models on p nodes of maximum degree d, for the class of so-called statistical algorithms recently introduced by Feldman et al. [1]. T...

متن کامل

Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations

Satisfying spin-assignments of triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a triangulation of a surface admits a satisfying spinassignment, and that it is #P-complete to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters A

سال: 1996

ISSN: 0375-9601

DOI: 10.1016/0375-9601(96)00176-4